G-SteX: Greedy Stem Extension for Free-Length Constrained Motif Discovery
نویسندگان
چکیده
Most available motif discovery algorithms in real-valued time series find approximately recurring patterns of a known length without any prior information about their locations or shapes. In this paper, a new motif discovery algorithm is proposed that has the advantage of requiring no upper limit on the motif length. The proposed algorithm can discover multiple motifs of multiple lengths at once, and can achieve a better accuracy-speed balance compared with a recently proposed motif discovery algorithm. We then briefly report two successful applications of the proposed algorithm to gesture discovery and robot motion pattern
منابع مشابه
Additional File 1 “GRISOTTO: A greedy approach to improve combinatorial algorithms for motif discovery with prior knowledge”
متن کامل
Discovering Multivariate Motifs using Subsequence Density Estimation and Greedy Mixture Learning
The problem of locating motifs in real-valued, multivariate time series data involves the discovery of sets of recurring patterns embedded in the time series. Each set is composed of several non-overlapping subsequences and constitutes a motif because all of the included subsequences are similar. The ability to automatically discover such motifs allows intelligent systems to form endogenously m...
متن کاملEffect of Drought Stress Levels on Seedling Morpho-physiological Traits of Alfalfa (Medicago sativa) Populations grown in Glasshouse
In order to study the effect of drought stress on seedling morpho-physiological traits of alfalfa (Medicago sativa), the seeds of ten populations were collected in their natural habitats from different parts of the Fars province, Iran in 2013. A factorial experiment was conducted using 10 alfalfa populations and four water stress treatments of 100, 75, 50, and 25% Field Capacity (FC) b...
متن کاملConstrained Motif Discovery
The goal of motif discovery algorithms is to efficiently find unknown recurring patterns in time series. Most available algorithms cannot utilize domain knowledge in any way which results in quadratic or at least sub-quadratic time and space complexity. For large time series datasets for which domain knowledge can be available this is a severe limitation. In this paper we define the Constrained...
متن کاملRegAnalyst: a web interface for the analysis of regulatory motifs, networks and pathways
RegAnalyst is a user-friendly web interface that integrates MoPP (Motif Prediction Program), MyPatternFinder (pattern detection tool) and MycoRegDB (mycobacterial promoter and regulatory elements database). Since motif discovery is a challenging task, numerous tools have been developed over the past few years. Strikingly, the existing programs were not successful in detecting the known consensu...
متن کامل